Pushing blocks is np-complete for noncrossing solution paths
نویسندگان
چکیده
منابع مشابه
Pairs of noncrossing free Dyck paths and noncrossing partitions
Using the bijection between partitions and vacillating tableaux, we establish a correspondence between pairs of noncrossing free Dyck paths of length 2n and noncrossing partitions of [2n + 1] with n + 1 blocks. In terms of the number of up steps at odd positions, we find a characterization of Dyck paths constructed from pairs of noncrossing free Dyck paths by using the Labelle merging algorithm.
متن کاملHilly poor noncrossing partitions and (2, 3)-Motzkin paths
A hilly poor noncrossing partition is a noncrossing partition with the properties : (1) each block has at most two elements, (2) in its linear representation, any isolated vertex is covered by some arc. This paper defines basic pairs as a combinatorial object and gives the number of hilly poor noncrossing partitions with n blocks, which is closely related to Maximal Davenport-Schinzel sequences...
متن کاملThe Smallest Pair of Noncrossing Paths in a Rectilinear Polygon
Smallest rectilinear paths are rectilinear paths with a minimum number of bends and with a minimum length, simultaneously. In this paper, given two pairs of terminals within a rectilinear polygon, we derive an algorithm to find a pair of noncrossing rectilinear paths within the polygon such that the total number of bends and the total length are both minimized. Although a smallest rectilinear p...
متن کاملWho Needs Crossings? Hardness of Plane Graph Rigidity
We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as applied to three types of graphs: “globally noncrossing” graphs, which avoid crossings in all of their configurations; matchstick graphs, with unit-length edges and where only noncrossing configurations are considered; and unrestricted graphs (crossings allowed) with unit edge lengths (or in the ...
متن کاملThe Inverse Shortest Paths Problem with Upper Bounds on Shortest Paths Costs
We examine the computational complexity of the inverse shortest paths problem with upper bounds on shortest path costs, and prove that obtaining a globally optimum solution to this problem is NP-complete. An algorithm for nding a locally optimum solution is proposed, discussed and tested.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001